Nordhaus-gaddum inequalities for anti fuzzy graph
نویسندگان
چکیده
The objective of this paper is to finds the lower and upper bounds Nordhaus-Gaddum inequalities fuzzy chromatic number for anti-fuzzy graph. This analyzes index complementary anti graphs in some cases. A theorem proved graph be k-critical. Examples are provided derive vertex coloring these graphs.
منابع مشابه
Nordhaus-Gaddum inequalities for domination in graphs
A node in a graph G = (V,E) is said to dominate itself and all nodes adjacent to it. A set S C V is a dominating set for G if each node in V is dominated by some node in S and is a double dominating set for G if each node in V is dominated by at least two nodes in S. First we give a brief survey of Nordhaus-Gaddum results for several domination-related parameters. Then we present new inequaliti...
متن کاملNordhaus-Gaddum for Treewidth
We prove that, for every n-vertex graph G, the treewidth of G plus the treewidth of the complement of G is at least n − 2. This bound is tight. © 2012 Gwenaël Joret and David R. Wood. Published by Elsevier Ltd. All rights reserved. Nordhaus–Gaddum-type theorems establish bounds on f (G) + f (G) for some graph parameter f , where G is the complement of a graph G. The literature has numerous exam...
متن کاملNordhaus-Gaddum Type Inequalities for Laplacian and Signless Laplacian Eigenvalues
Let G be a graph with n vertices. We denote the largest signless Laplacian eigenvalue of G by q1(G) and Laplacian eigenvalues of G by μ1(G) > · · · > μn−1(G) > μn(G) = 0. It is a conjecture on Laplacian spread of graphs that μ1(G)−μn−1(G) 6 n − 1 or equivalently μ1(G) + μ1(G) 6 2n − 1. We prove the conjecture for bipartite graphs. Also we show that for any bipartite graph G, μ1(G)μ1(G) 6 n(n − ...
متن کاملNordhaus-Gaddum inequalities for the fractional and circular chromatic numbers
For a graph G on n vertices with chromatic number χ(G), the Nordhaus–Gaddum inequalities state that d2 √ ne ≤ χ(G) + χ(G) ≤ n + 1, and n ≤ χ(G) · χ(G) ≤ ⌊( n+1 2 )2⌋ . Much analysis has been done to derive similar inequalities for other graph parameters, all of which are integer-valued. We determine here the optimal Nordhaus–Gaddum inequalities for the circular chromatic number and the fraction...
متن کاملInequalities of Nordhaus–gaddum Type for Connected Domination
A set S of vertices of a graph G is a connected dominating set if every vertex not in S is adjacent to some vertex in S and the subgraph induced by S is connected. The connected domination number γc(G) is the minimum size of a connected dominating set of G. In this paper we prove that γc(G) + γc(G) ≤ min{δ(G), δ(G)} + 4 for every n-vertex graph G such that G and G have diameter 2 and show that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kongunadu research journal
سال: 2022
ISSN: ['2349-2694']
DOI: https://doi.org/10.26524/krj.2022.3